Two-Way Two-Tape Automata
نویسندگان
چکیده
In this article we consider two-way two-tape (alternating) automata accepting pairs of words and we study some closure properties of this model. Our main result is that such alternating automata are not closed under complementation for non-unary alphabets. This improves a similar result of Kari and Moore for picture languages. We also show that these deterministic, non-deterministic and alternating automata are not closed under composition.
منابع مشابه
Three-Way Two-Dimensional Deterministic Finite Automata with Rotated Inputs
Inoue et al. introduced an automaton on a twodimensional tape, which decides acceptance or rejection of an input tape by scanning the tape from various sides by various automata which move one way, and investigated the accepting power of such an automaton. This paper continues the investigation of this type of automata, especially, ∨-type automata (obtained by combining four three-way two-dimen...
متن کامل2-tape 1-way Quantum Finite State Automata
1-way quantum finite state automata are reversible in nature, which greatly reduces its accepting property. In fact, the set of languages accepted by 1-way quantum finite automata is a proper subset of regular languages. We introduce 2-tape 1-way quantum finite state automaton (2T1QFA(2))which is a modified version of 1-way 2-head quantum finite state automaton(1QFA(2)). In this paper, we repla...
متن کاملA Note on Decision Problems for Three-Way Two-Dimensional Finite Automata
In [2], Blum and Hewitt introduced a two-dimensional finite automaton which can be considered as a natural extension of the one-dimensional two-way finite automaton [4] to two dimensions. On the other hand, in [7,8], Rosenfeld introduced a new type of automaton on a two-dimensional tape (called the three-way two-dimensional finite automaton) which can be considered as a natural extension of the...
متن کاملTranslation from classical two-way automata to pebble two-way automata
We study the relation between the standard two-way automata and more powerful devices, namely, two-way finite automata with an additional “pebble” movable along the input tape. Similarly as in the case of the classical two-way machines, it is not known whether there exists a polynomial trade-off, in the number of states, between the nondeterministic and deterministic pebble two-way automata. Ho...
متن کاملDeterministic Autopoietic Automata
In 2001, van Leeuwen and Wiedermann [1] have defined evolving interactive systems, in particular sequences of interactive finite automata with global states, to model infinite computations on an ever changing machine or system of machines. Modern computation does not just happen on an individual machine for a fixed time, but it goes on forever over an unbounded number of software and hardware c...
متن کامل